A Boat on Wheels

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Chromaticity of Wheels

Let the vertices of a graph such that every two adjacent vertices have different color is a very common problem in the graph theory. This is known as proper coloring of graphs. The possible number of different proper colorings on a graph with a given number of colors can be represented by a function called the chromatic polynomial. Two graphs G and H are said to be chromatically equivalent, if ...

متن کامل

A Subjective Spin on Roulette Wheels

We provide a simple behavioral definition of ‘subjective mixture’ of acts for a large class of (not necessarily expected-utility) preferences. Subjective mixtures enjoy the same algebraic properties as the ‘objective mixtures’ used to great advantage in the decision setting introduced by Anscombe and Aumann (1963). This makes it possible to formulate mixture-space axioms in a fully subjective s...

متن کامل

Cyclins: wheels within wheels.

Cycimns were originally defined as proteins which are synthesized in each cell cycle and destroyed at every mitosis. Cyclins were discovered by T. Hunt and students at the Marine Biological Laboratory, Woods Hole, MA, duningthe 1982 Physiology Course (1). They labeled eggs ofthe sea urchin Arbacia punctulata with [35S]methionine after fertilization and analyzed the temporal pattern of protein s...

متن کامل

A note on "Folding wheels and fans."

In [6] Gervacio, Guerrero and Rara obtained formulas for the size of the largest clique onto which a graph G folds. We prove an interpolation lemma which simplifies some of their arguments and we correct a mistake in their formula for wheels.

متن کامل

Optimum Path Packing on Wheels :

We show that, given a wheel with nonnegative edge lengths and pairs of terminals located on the wheel's outer cycle such that no two terminal pairs cross, then a path packing, i. e., a collection of edge disjoint paths connecting the given terminal pairs, of minimum length can be found in strongly polynomial time. Moreover, we exhibit for this case a system of linear inequalities that provides ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific American

سال: 1902

ISSN: 0036-8733

DOI: 10.1038/scientificamerican04191902-276